On matrices with cyclic structure

نویسنده

  • Hans Schneider
چکیده

The relations between several necessary conditions for a square complex matrix A to be m-cyclic are examined. These conditions are known to be equivalent if A is an irreducible nonnegative matrix whose index of imprimitivity is m. In particular, we ®nd that if the digraph of A contains at least one cycle with nonzero signed length, then the following conditions are each equivalent to the m-cyclicity of A: (i) A is diagonally similar to e2pi=mA; (ii) all cycles in the digraph of A have signed length an integral multiple of m. In the course of our investigations, we lay down the groundwork of the theory of cyclically m-partite or linearly partite digraphs, and characterize these digraphs in terms of the signed lengths of their cycles. The characterization of diagonal similarity between matrices in terms of matrix cycle products due to Saunders and Schneider plays a key role in our development. Our investigations also lead to a new illuminating conceptual proof for the second part of the Frobenius theorem on an irreducible nonnegative matrix. The connection between the m-cyclicity of a square complex matrix and that of its associated collection of elementary Jordan blocks is studied in the second half of this paper. In particular, for an m-cyclic collection U it is found that the problem of determining all m-tuples …k1; . . . ; km† of positive integers for which there exists an m-cyclic matrix A in the superdiagonal …k1; . . . ; km†-block form such that U…A† ˆ U is equivalent to determine all row sum vectors of (0,1)-matrices that have a prescribed column sum vector and each of whose column vectors has cyclically consecutive equal components. As a by-product we also obtain an equivalent condition on m given square complex matrices B1; . . . ;Bm so that there exist complex rectangular matrices A1; . . . ;Am that satisfy Bj ˆ Aj AmA1 Ajÿ1 for j ˆ 1; . . . ;m, thus completwww.elsevier.com/locate/laa q Research was partially supported by the National Science Council of the Republic of China. * E-mail: [email protected] 0024-3795/99/$ see front matter Ó 1999 Elsevier Science Inc. All rights reserved. PII: S 0 0 2 4 3 7 9 5 ( 9 9 ) 0 0 0 9 7 X Linear Algebra and its Applications 302±303 (1999) 377±410 ing the work of Flanders for the case m ˆ 2. Ó 1999 Elsevier Science Inc. All rights

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structure of Wavelet Covariance Matrices and Bayesian Wavelet Estimation of Autoregressive Moving Average Model with Long Memory Parameter’s

In the process of exploring and recognizing of statistical communities, the analysis of data obtained from these communities is considered essential. One of appropriate methods for data analysis is the structural study of the function fitting by these data. Wavelet transformation is one of the most powerful tool in analysis of these functions and structure of wavelet coefficients are very impor...

متن کامل

The Cyclic Sieving Phenomenon on the Alternating Sign Matrices

We first present a previously unpublished result of Stanton [11] that the group of order four generated by rotation by 90◦ acting on alternating sign matrices exhibits the CSP with the obvious q-analogue of |ASM(n)|. In [12], Wieland introduced a much larger cyclic group that acts on the set of alternating sign matrices. Unfortunately, it has a very complex orbit structure that does not exhibit...

متن کامل

Gyrovector Spaces on the Open Convex Cone of Positive Definite Matrices

‎In this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional Euclidean spaces‎, ‎which are the Einstein and M"{o}bius gyrovector spaces‎. ‎We introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and explore its...

متن کامل

A Complexity-Reduced Iterative Algorithm for Decoding Cyclic Finite Geometry LDPC Codes

Although cyclic LDPC codes constructed based on finite geometries achieve excellent performance, the relatively high densities of their parity-check matrices make the hardware implementation complexity of the decoders quite large. An effective algorithm for decoding cyclic finite geometry LDPC codes based on the cyclic structure and appropriate partition of their parity check matrices is presen...

متن کامل

Vibration Attenuation Timoshenko Beam Based on Optimal Placement Sensors/Actuators PZT Patches with LQR-MOPSO

The main objective of this study is to reduce optimal vibration suppression of Timoshenko beam under non-periodic step and impulse inputs. Cantilever beam was modeled by Timoshenko theory and finite element numerical method. Stiffness (K), mass (M), and damping (C) matrices are extracted. Then, in order to control structure vibration, piezoelectric patches were used due to simultaneous dual beh...

متن کامل

Diagonal stability of matrices with cyclic structure and the secant condition

An existence result on diagonal solutions of a linear matrix inequality is used to study diagonal Hurwitz and Schur stability and to derive the secant condition for systems with cyclic structure. © 2008 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999